Free semidefinite representation of matrix power functions
نویسندگان
چکیده
منابع مشابه
Polynomial Matrix Inequality and Semidefinite Representation
Consider a convex set S = {x ∈ D : G(x) o 0} where G(x) is a symmetric matrix whose every entry is a polynomial or rational function, D ⊆ R is a domain on which G(x) is defined, and G(x) o 0 means G(x) is positive semidefinite. The set S is called semidefinite representable if it equals the projection of a higher dimensional set which is defined by a linear matrix inequality (LMI). This paper s...
متن کاملMatrix representation of cryptographic functions
The Discrete Logarithm and the Diffie-Hellman are two hard computational problems, closely related to cryptography and its applications. The computational equivalence of these problems has been proved only for some special cases. In this study, using LU-decomposition to Vandermonde matrices, we are able to transform the two problems in terms of matrices, thus giving a new perspective to their e...
متن کاملMatrix Functions and Weighted Centers for Semidefinite Programming
In this paper, we develop various differentiation rules for general smooth matrix-valued functions, and for the class of matrix convex (or concave) functions first introduced by Löwner and Kraus in the 1930s. For a matrix monotone function, we present formulas for its derivatives of any order in an integral form. Moreover, for a general smooth primary matrix function, we derive a formula for al...
متن کاملSemidefinite representation of convex sets
Let S = {x ∈ R : g1(x) ≥ 0, · · · , gm(x) ≥ 0} be a semialgebraic set defined by multivariate polynomials gi(x). Assume S is convex, compact and has nonempty interior. Let Si = {x ∈ R : gi(x) ≥ 0}, and ∂S (resp. ∂Si) be the boundary of S (resp. Si). This paper, as does the subject of semidefinite programming (SDP), concerns Linear Matrix Inequalities (LMIs). The set S is said to have an LMI rep...
متن کاملSemidefinite Functions on Categories
Freedman, Lovász and Schrijver characterized graph parameters that can be represented as the (weighted) number of homomorphisms into a fixed graph. Several extensions of this result have been proved. We use the framework of categories to prove a general theorem of this kind. Similarly as previous resuts, the characterization uses certain infinite matrices, called connection matrices, which are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.09.038